Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization
نویسندگان
چکیده
The NAS facility has operated parallel supercomputers for the past 11 years, including the Intel iPSC/860, Intel Paragon, Thinking Machines CM-5, IBM SP-2, and Cray Origin 2000. Across this wide variety of machine architectures, across a span of 10 years, across a large number of different users, and through thousands of minor configuration and policy changes, the utilization of these machines shows three general trends: (1) scheduling using a naive FCFS first-fit policy results in 40-60% utilization, (2) switching to the more sophisticated dynamic backfilling scheduling algorithm improves utilization by about 15 percentage points (yielding about 70% utilization), and (3) reducing the maximum allowable job size further increases utilization. Most surprising is the consistency of these trends. Over the lifetime of the NAS parallel systems, we made hundreds, perhaps thousands, of small changes to hardware, software, and policy, yet utilization was affected little. In particular, these results show that the goal of achieving near 100% utilization while supporting a real parallel supercomputing workload is unrealistic.
منابع مشابه
Optimal Utilization Bounds for the Fixed-priority Scheduling of Periodic Task
In fixed-priority scheduling the priority of a job, once assigned, may not change. A new fixed-priority algorthm for scheduling systems of periodic tasks upon identical multiprocessors is proposed. This algorithm has an achievable utilization of (m + 1)/2 upon m unit-capacity processors. It is proven that this algorithm is optimal from the perspective of achievable utilization, in the sense tha...
متن کاملAn Analysis of Traces from a Production MapReduce Cluster (CMU-PDL-09-107)
MapReduce is a programming paradigm for parallel processing that is increasingly being used for data-intensive applications in cloud computing environments. An understanding of the characteristics of workloads running in MapReduce environments benefits both the service providers in the cloud and users: the service provider can use this knowledge to make better scheduling decisions, while the us...
متن کاملAn Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration
Effective scheduling strategies to improve response times, throughput, and utilization are an important consideration in large supercomputing environments. Such machines have traditionally used space-sharing strategies to accommodate multiple jobs at the same time. This approach, however, can result in low system utilization and large job wait times. This paper discusses three techniques that c...
متن کاملA Comparative Analysis of Space- and Time-Sharing Techniques for Parallel Job Scheduling in Large Scale Parallel Systems
Effective scheduling strategies to improve response times, throughput, and utilization are an important consideration in large supercomputing environments. Such machines have traditionally used spacesharing strategies to accommodate multiple jobs at the same time. This approach, however, can result in low system utilization and large job wait times. This paper discusses three techniques that ca...
متن کاملOn the Effectiveness of Buffer in Deterministic Services
We study the utility of buffer at switches in increasing the achievable utilization of a network providing deterministic guarantee. To determine the increase in utilization, we classify packet scheduling algorithms into two classes. Only one of these classes can utilize additional buffers to increase the achievable utilization. We experimentally determine the difference in achievable utilizatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999